Random Walk Loop Soup
نویسندگان
چکیده
The Brownian loop soup introduced in [3] is a Poissonian realization from a σ-finite measure on unrooted loops. This measure satisfies both conformal invariance and a restriction property. In this paper, we define a random walk loop soup and show that it converges to the Brownian loop soup. In fact, we give a strong approximation result making use of the strong approximation result of Komlós, Major, and Tusnády. To make the paper self-contained, we include a proof of the approximation result that we need.
منابع مشابه
ar X iv : m at h / 06 11 77 5 v 1 [ m at h . PR ] 2 5 N ov 2 00 6 Colored loop - erased random walk on the complete graph ∗
Starting from a sequence regarded as a walk through some set of values, we consider the associated loop-erased walk as a sequence of directed edges, with an edge from i to j if the loop erased walk makes a step from i to j. We introduce a coloring of these edges by painting edges with a fixed color as long as the walk does not loop back on itself, then switching to a new color whenever a loop i...
متن کاملTwo-sided loop-erased random walk in three dimensions
The loop-erased random walk (LERW) in three dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.
متن کاملThe infinite two-sided loop-erased random walk
The loop-erased random walk (LERW) in Zd, d ≥ 2, dimensions is obtained by erasing loops chronologically from simple random walk. In this paper we show the existence of the two-sided LERW which can be considered as the distribution of the LERW as seen by a point in the “middle” of the path.
متن کاملThe scaling limit of loop-erased random walk in three dimensions
Loop-erased random walk is a model for a random simple (i.e. non-selfintersecting) path created by taking a random walk and, whenever it hits itself, deleting the resulting loop and continuing. We will explain why this model is interesting and why scaling limits are interesting, and then go on to describe the proof (that the limit exists), as time will permit.
متن کاملConvergence of loop-erased random walk in the natural parameterization
We prove that loop-erased random walk parametrized by renormalized length converges in the lattice size scaling limit to SLE2 parametrized by Minkowski content.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004